Establishing motion correspondence

We propose a proximal uniformity constraint to solve the correspondence problem. According to this constraint, most objects in the real world follow smooth paths and cover a small distance in a small time. An efficient, non iterative polynomial time approximation algorithm which minimizes the proximal uniformity cost function and establishes correspondence over n frames is proposed. Any method u s ing smoothness of motion alone cannot operate correctly without assuming correct initial correspondence, the correspondence in first two frames. Therefore, we propose the use of gradient based optical flow for establishing the initial correspondence. This way the proposed approach combines the qualities of the gradient and token based methods for motion correspondence. The algorithm is then extended to take care of restricted cases of occlusion. The experimental results for real and synthetic sequences are presented to support our claims.